A stretch in time

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Stolt stretch time migration

We implement Stolt-stretch time migration with an analytical formulation for the optimal stretch parameter and show how it improves the quality of imaging. By a cascaded f-k migration approach with this algorithm, we manage to obtain time migration results on real data comparable to Gazdag’s phase-shift method, with a high accuracy for steeply deeping events at a computational cost dramatically...

متن کامل

Time Stretch Inspired Computational Imaging

We show that dispersive propagation of light followed by phase detection has properties that can be exploited for extracting features from the waveforms. This discovery is spearheading development of a new class of physics-inspired algorithms for feature extraction from digital images with unique properties and superior dynamic range compared to conventional algorithms. In certain cases, these ...

متن کامل

a time-series analysis of the demand for life insurance in iran

با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند

Optical Data Compression in Time Stretch Imaging

Time stretch imaging offers real-time image acquisition at millions of frames per second and subnanosecond shutter speed, and has enabled detection of rare cancer cells in blood with record throughput and specificity. An unintended consequence of high throughput image acquisition is the massive amount of digital data generated by the instrument. Here we report the first experimental demonstrati...

متن کامل

Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time

The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n) edge 3spanner for it in O(log n) time. This algorithm is then extended into a deterministic algorithm for computing an O(k n) edge O(k)-spanner in 2 logk−1 n time for every integer parameter k 1. This establishes that the problem of the deterministic construction of a linear (in k) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 2016

ISSN: 0028-0836,1476-4687

DOI: 10.1038/nature16873